Reasoning about distributed information with infinitely many agents

Spatial constraint systems (scs) are semantic structures for reasoning about spatial and epistemic information in concurrent systems. We develop the theory of scs to reason distributed potentially infinite groups . characterize notion a group agents as infimum set join-preserving functions that represent spaces group. provide an alternative characterization this greatest family satisfy certain basic properties. For completely distributive lattices, we establish c amongst is lower bound all possible combinations derive show compositionality results these characterizations conditions under which can be obtained by also finite Finally, application mathematical morphology where dilations, one its fundamental operations, define on powerset lattice. represents particular dilation such scs.